Management of parking spaces

ABSTRACT

Management of parking spaces in a parking area comprising a plurality of zones. A ticket is provided to an individual associated with a vehicle parked in the parking area, and the ticket is associated with the vehicle. Also, a first zone in which the vehicle is parked is identified. Responsive to the individual validating the ticket, it is determined that the vehicle associated with the ticket will be leaving the identified first zone, and there is provided an indication that a parking space of the identified first zone is to become available.

BACKGROUND

The present invention relates to the field of parking area management,and more particularly to management of parking spaces in a parking area.

A parking area (i.e., parking lot, car park, parking garage, car lot,etc.) is typically a cleared area that is intended for parking vehicles.Parking areas can be of many varying sizes, and can be intended for useby varying types of vehicles (e.g., cars, bicycles, motorcycles,industrial vehicles, etc.). Depending on a location or an intended use,use of a parking area can be free of charge, or require payment of afee.

Many instances of parking areas require payment of a fee utilize aticketing or validation system. Upon entry to a parking area, anindividual in a vehicle can obtain a ticket (e.g. from an attendant oran automated ticketing system). In an example, the ticket can indicatethe time that the vehicle entered the parking area. Before exiting theparking area, the individual pays a required fee (e.g., to the attendantor the automated ticketing system) corresponding to the amount of timethe vehicle has been parked in the parking area. The ticket may then bevalidated (or exchanged for an exit voucher, ticket, token or the like)so as to permit the vehicle to leave the parking area.

To assist in finding a free parking space in a parking area, someparking areas provide a system for indicating whether parking spaces arefree/available. If such a system indicates that parking area is full ornearly full, a driver of a vehicle can end up driving around the parkingarea trying to identify a free space, which can cause frustration andwaste fuel.

SUMMARY

Aspects of an embodiment of the present invention disclose a method formanagement of parking spaces in a parking area comprising a plurality ofzones, in which each zone comprises one or more parking spaces. Themethod comprises providing a ticket to an individual associated with avehicle parked in the parking area and associating the ticket with thevehicle associated with the individual. The method further comprisesidentifying a first zone in which the vehicle is parked. Responsive tothe individual validating the ticket, the method further comprisesdetermining that the vehicle associated with the ticket will be leavingthe identified first zone. The method further comprises providing anindication that a parking space of the identified first zone is tobecome available.

Aspects of another embodiment of the present invention disclose acomputer program product for management of parking spaces in a parkingarea comprising a plurality of zones, in which each zone comprising oneor more parking spaces. The computer program product comprises acomputer readable storage medium having program instructions embodiedtherewith, wherein the program instructions are executable by aprocessing unit to cause the processing unit to perform a methodcomprising: providing a ticket to an individual associated with avehicle parked in the parking area; associating the ticket with thevehicle associated with the individual; identifying a first zone inwhich the vehicle is parked; responsive to the individual validating theticket, determining that the vehicle associated with the ticket will beleaving the identified first zone; and providing an indication that aparking space of the identified first zone is to become available.

Aspects of yet another embodiment of the present invention disclose asystem for management of parking spaces in a parking area comprising aplurality of zones, in which each zone comprising one or more parkingspaces. The system comprises a ticketing system adapted to provide aticket to an individual associated with a vehicle parked in the parkingarea and to associate the ticket with the vehicle associated with theindividual. The system also comprises a vehicle identification unitadapted to identify a first zone in which the vehicle is parked. Thesystem further comprises a parking management unit adapted to,responsive to the individual validating the ticket, determine that thevehicle associated with the ticket will be leaving the identified firstzone, and to provide an indication that a parking space of theidentified first zone is to become available.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 depicts a pictorial representation of an example distributedsystem in which aspects of the illustrative embodiments may beimplemented.

FIG. 2 depicts a block diagram of an example system in which aspects ofthe illustrative embodiments may be implemented.

FIG. 3 depicts a simplified block diagram of a system for management ofparking spaces in a parking area according to an embodiment.

FIG. 4 illustrates a flow diagram of a parking management programaccording to an embodiment.

FIG. 5 illustrates a system for parking area management according to anembodiment.

DETAILED DESCRIPTION

It should be understood that the Figures are merely schematic and arenot drawn to scale. It should also be understood that the same referencenumerals are used throughout the Figures to indicate the same or similarparts.

In the context of the present application, where embodiments of thepresent invention constitute a method, it should be understood that sucha method is a process for execution by a computer, i.e. is acomputer-implementable method. The various steps of the method thereforereflect various parts of a computer program, e.g. various parts of oneor more algorithms.

Also, in the context of the present application, a system may be asingle device or a collection of distributed devices that are adapted toexecute one or more embodiments of the methods of the present invention.For instance, a system may be a personal computer (PC), a server or acollection of PCs and/or servers connected via a network such as a localarea network, the Internet and so on to cooperatively execute at leastone embodiment of the methods of the present invention.

Embodiments of the present invention provide an approach for preemptingwhen a parking space in a parking area is to become available. Byidentifying when a parking ticket is validated (e.g. when a feeassociated with the ticket is paid, or when the ticket is presented toan attendant or validation system), embodiments of the present inventioninfer that a parking space, such as that being occupied by a vehicle ofa vehicle user who has validated the parking ticket, will becomeavailable within a reasonably short time period following the time ofticket validation. In other words, responsive to the vehicle uservalidating a parking ticket, embodiments of the present inventiondetermine when a vehicle will be leaving the parking area, and thus,determine when a parking space will become available.

For example, by associating a parking ticket with a vehicle andidentifying a zone or area within which the vehicle is parked,embodiments of the present invention determine that a parking spacewithin the identified zone or area will become available shortly afterthe parking ticket associated with that vehicle is validated. This may,in turn, enable an indication to be generated, wherein the indicationcommunicates the area or zone in which a parking space is predicted tobecome available, and this may be done prior to the parking spaceactually becoming available (i.e., in the timeframe following validationof the parking ticket but before the vehicle leaves its parking space).Proposed embodiments advise users (e.g., individuals or vehiclesentering the parking area) where in the parking area a parking spacewill shortly become available (e.g., within the next few minutes).

In this way, effective prediction of a parking space becoming availableis based on linking a parking ticket with a vehicle and then monitoringwhen the parking ticket is validated. Further, by identifying where thevehicle is parked (either roughly to within a sub-area or zone of theparking area, or accurately to within an individual parking space),embodiments of the present invention predict where in the parking area aparking space will become available shortly after the parking ticket isvalidated. By predicting where the parking space will become available,an indication can be provided, so as to direct a waiting vehicle towardsthe predicted zone or parking space.

Proposed embodiments therefore preemptively identify parking spaces thatwill become available. Such embodiments need not wait for a parkingspace to actually become available (e.g. be vacated by a vehicle).Instead, embodiments of the present invention infer that a parking spaceis expected to become available within a predicted timeframe (such as atime window of less than 10 minutes, less than 5 minutes, or less than 2minutes) following validation (e.g. payment, stamping, processing, etc.)of a parking ticket.

For instance, and simply by way of example only, by linking when aparking ticket has been validated or paid with a parking area,embodiments of the present invention notify other vehicle users (e.g. byusing signage) that a vehicle is due to leave a parking space within acertain predicted timeframe (say 5 or 10 minutes) negating a need forthese other vehicle users to aimlessly drive around the parking areasearching for a parking space.

Further, some embodiments monitor and/or track vehicle positions in azoned parking area, which may be done in conjunction with associatingparking tickets with vehicles. In this way, responsive to a parkingticket being validated (e.g. a fee associated with the parking ticketbeing paid), proposed embodiments infer that the vehicle associated withthe parking ticket will be vacating its parking space (within the zoneit was monitored/tracked to) and an indication may then be provided toanother vehicle that a parking space of a particular zone/area of theparking area will become available. Waiting and/or entering vehicles maythus be guided to zones of the parking area where parking spaces arepredicted to shortly become available prior to the spaces actually beingavailable (i.e. vacated).

Further, based on the monitored and/or tracked vehicle positions, someembodiments identify a zone in which the vehicle is parked. Otherembodiments identify a parking space in which the vehicle is parked.Embodiments provide an indication that the identified parking space isto become available. In this way, indications or predictions relating toindividual or single parking spaces can be provided, and this may thenenable the provision of accurate indications or directions to a specificparking space to be provided. This may further reduce or limit a needfor another vehicle to drive around the parking area (or a zone of theparking area) searching for a parking space or space that is to becomeavailable.

In some embodiments, identifying a first zone in which the vehicle isparked involves utilizing images or video received from one or moreimage capture devices adapted to capture images or video of the parkingarea. For example, an embodiment of the present invention processes theimages or video in accordance with a vehicle registration platerecognition algorithm (such as an Automatic Number Plate Recognition(ANPR) process). In this way, embodiments may implement knownimage/video analysis or processing concepts for identifying, tracking ormonitoring vehicles. Such image/video analysis or processing conceptsmay be widely used and have extensive and/or powerful identification andtracking capabilities that may be leveraged by proposed concepts.Embodiments may therefore be implemented using existing technologiesthat may be cheaply and/or widely available, thus reducing associateddifficulties and/or costs.

In some embodiments, providing an indication is based on a statisticalmodel. Such a statistical model, for example, provides a probability ofa departure time of a vehicle from the parking area. For instance, aprobabilistic model that is based upon parking locations, ticketvalidation location, and/or travel times and/or speeds of vehicle usersmay be employed. Thus, a prediction engine utilizes statistical modelingsoftware to create a statistical model based on parking area data. In anembodiment, for a validated parking ticket associated with a vehicleparked in the parking area, a prediction engine utilizes statisticalmodeling software to create an instance of a statistical model based onvehicle location data. The statistical model may be based on historicaldata (e.g., previous journey or departure times for vehicle users thatparked in the same location) associated with vehicle location data.Further, in an embodiment, the statistical model is stored in a storagedevice and associated with a corresponding instance of vehicle data. Inthis way, a parking space prediction engine may utilize a statisticalmodel to determine probabilities of a departure time of a vehicle fromthe parking area relative to a validation time of a parking ticketassociated with the vehicle. For example, when a parking ticketassociated with a vehicle parked in a first zone of the parking area isvalidated, the statistical model may indicate that there is an 85%probability that the vehicle will leave its parking space after tenminutes (based on previous timeframes taken for vehicles parked in thefirst zone to depart the parking area following ticket validation).

Proposed embodiments comprise obtaining an indication of a location atwhich the parking ticket was validated. Providing an indication may thenbe based on a location of the identified first zone relative to thelocation at which the parking ticket was validated. In this way,embodiments may take account of a distance between the vehicle andvehicle user when the parking ticket is validated, thus enabling a timetaken for the vehicle user to reach the vehicle to be estimated andaccounted for in predicting a time at which the vehicle will vacate itsparking space. Accurate indications of when a parking space is to becomeavailable may therefore be provided by proposed embodiments.

Embodiments of the present invention track the movement of the vehiclewithin the parking area using conventional vehicle tracking concepts,image/video capture processing, radio frequency identification tagmonitoring, etc., so as to identify a zone in which the vehicle isparked. Such information about the vehicle's whereabouts within theparking area is then used for providing an indication as to where aparking space is predicted to become available when it is determinedthat the vehicle will be leaving (i.e. vacating its parking space).

Accordingly, embodiments of the present invention provide an approach toextend parking area management systems such that empty/available parkingspaces may be pre-emptively identified (i.e. predicted) before they areactually vacated by a vehicle. Different ways to identify when a parkingspace may become available may be employed by embodiments, and these maybe implemented in isolation or in combination. Embodiments of thepresent invention propose modifications and additional steps to atraditional (parking area) management systems, which enhance the valueand utility of the proposed concepts.

Illustrative embodiments may be utilized in many different types ofvehicle parking environments. Illustrative embodiments may, for example,be employed in relation to multi-story car parks (i.e. buildingsdesigned for car parking and where there are a number of floors orlevels on which parking spaces are provided) or street parking utilizinga pay/validate by phone system.

Illustrative embodiments may be utilized in many different types of dataprocessing environments. In order to provide a context for thedescription of elements and functionality of the illustrativeembodiments, FIGS. 1 and 2 are provided hereafter as exampleenvironments in which aspects of the illustrative embodiments may beimplemented. It should be appreciated that FIGS. 1 and 2 are onlyexamples and are not intended to assert or imply any limitation withregard to the environments in which aspects or embodiments of thepresent invention may be implemented. Many modifications to the depictedenvironments may be made without departing from the spirit and scope ofthe present invention.

FIG. 1 depicts a pictorial representation of an example distributed dataprocessing system in which aspects of the illustrative embodiments maybe implemented. Distributed data processing system 100 may include anetwork of computers in which aspects of the illustrative embodimentsmay be implemented. Distributed data processing system 100 contains atleast network 102, which is the medium used to provide communicationlinks between various devices and computers connected together withindistributed data processing system 100. Network 102 may includeconnections, such as wire, wireless communication links, or fiber opticcables.

In the depicted example, server 104 and server 106 are connected tonetwork 102 along with storage unit 108. In addition, clients 110, 112,and 114 are also connected to network 102. Clients 110, 112, and 114 maybe, for example, personal computers, network computers, or the like. Inthe depicted example, server 104 provides data, such as boot files,operating system images, and applications to clients 110, 112, and 114.Clients 110, 112, and 114 are clients to server 104 in the depictedexample. Distributed data processing system 100 may include additionalservers, clients, and other devices not shown.

In the depicted example, distributed data processing system 100 is theInternet with network 102 representing a worldwide collection ofnetworks and gateways that use the Transmission ControlProtocol/Internet Protocol (TCP/IP) suite of protocols to communicatewith one another. At the heart of the Internet is a backbone ofhigh-speed data communication lines between major nodes or hostcomputers, consisting of thousands of commercial, governmental,educational and other computer systems that route data and messages. Ofcourse, distributed data processing system 100 may also be implementedto include a number of different types of networks, such as for example,an intranet, a local area network (LAN), a wide area network (WAN), orthe like. As stated above, FIG. 1 is intended as an example, not as anarchitectural limitation for different embodiments of the presentinvention, and therefore, the particular elements shown in FIG. 1 shouldnot be considered limiting with regard to the environments in which theillustrative embodiments of the present invention may be implemented.

FIG. 2 is a block diagram of an example system 200 in which aspects ofthe illustrative embodiments may be implemented. System 200 is anexample of a computer, such as client 110 in FIG. 1, in which computerusable code or instructions implementing the processes for illustrativeembodiments of the present invention may be located.

In the depicted example, system 200 employs a hub architecture includingnorth bridge and memory controller hub (NB/MCH) 202 and south bridge andinput/output (I/O) controller hub (SB/ICH) 204. Processing unit 206,main memory 208, and graphics processor 210 are connected to NB/MCH 202.Graphics processor 210 may be connected to NB/MCH 202 through anaccelerated graphics port (AGP).

In the depicted example, local area network (LAN) adapter 212 connectsto SB/ICH 204. Audio adapter 216, keyboard and mouse adapter 220, modem222, read only memory (ROM) 224, hard disk drive (HDD) 226, CD-ROM drive230, universal serial bus (USB) ports and other communication ports 232,and PCI/PCIe devices 234 connect to SB/ICH 204 through first bus 238 andsecond bus 240. PCI/PCIe devices may include, for example, Ethernetadapters, add-in cards, and PC cards for notebook computers. PCI uses acard bus controller, while PCIe does not. ROM 224 may be, for example, aflash basic input/output system (BIOS).

HDD 226 and CD-ROM drive 230 connect to SB/ICH 204 through second bus240. HDD 226 and CD-ROM drive 230 may use, for example, an integrateddrive electronics (IDE) or a serial advanced technology attachment(SATA) interface. Super I/O (SIO) device 236 may be connected to SB/ICH204.

An operating system runs on processing unit 206. The operating systemcoordinates and provides control of various components within system 200in FIG. 2. As a client, the operating system may be a commerciallyavailable operating system. An object-oriented programming system, suchas the JAVA™ programming system, may run in conjunction with theoperating system and provides calls to the operating system from JAVA™programs or applications executing on system 200.

As a server, system 200 may be, for example, an IBM® eServer™ System p®computer system, running the Advanced Interactive Executive (AIX®)operating system or the LINUX® operating system. System 200 may be asymmetric multiprocessor (SMP) system including a plurality ofprocessors in processing unit 206. Alternatively, a single processorsystem may be employed.

Instructions for the operating system, the programming system, andapplications or programs are located on storage devices, such as HDD226, and may be loaded into main memory 208 for execution by processingunit 206. Similarly, one or more message processing programs accordingto an embodiment may be adapted to be stored by the storage devicesand/or main memory 208.

The processes for illustrative embodiments of the present invention maybe performed by processing unit 206 using computer usable program code,which may be located in a memory such as, for example, main memory 208,ROM 224, or in one or more peripheral devices, such as HDD 226 andCD-ROM 230.

A bus system, such as first bus 238 or second bus 240 as shown in FIG.2, may comprise one or more buses. Of course, the bus system may beimplemented using any type of communication fabric or architecture thatprovides for a transfer of data between different components or devicesattached to the fabric or architecture. A communication unit, such asmodem 222 or network adapter 212 of FIG. 2, may include one or moredevices used to transmit and receive data. A memory may be, for example,main memory 208, ROM 224, or a cache such as found in NB/MCH 202 in FIG.2.

Those of ordinary skill in the art will appreciate that the hardware inFIGS. 1 and 2 may vary depending on the implementation. Other internalhardware or peripheral devices, such as flash memory, equivalentnon-volatile memory, or optical disk drives and the like, may be used inaddition to or in place of the hardware depicted in FIGS. 1 and 2. Also,the processes of the illustrative embodiments may be applied to amultiprocessor data processing system, other than the system mentionedpreviously, without departing from the spirit and scope of the presentinvention.

Moreover, system 200 may take the form of any of a number of differentdata processing systems including client computing devices, servercomputing devices, a tablet computer, laptop computer, telephone orother communication device, a personal digital assistant (PDA), or thelike. In some illustrative examples, system 200 may be a portablecomputing device that is configured with flash memory to providenon-volatile memory for storing operating system files and/oruser-generated data, for example. Thus, system 200 may essentially beany known or later-developed data processing system withoutarchitectural limitation.

Embodiments of the present invention enhance a parking area managementsystem by identifying when a parking space is to become available priorto a vehicle actually vacating the parking space.

Embodiments of the present invention pre-empt the vacating of a parkingspace before the parking space is vacated by a vehicle. By associating aparking ticket or token with a vehicle and identifying a location of thevehicle, embodiments of the present invention infer that a vehicleassociated with a parking ticket or token will shortly leave theidentified rough/approximate location when the parking ticket isvalidated (e.g. a tariff associated with the ticket is paid). Anindication may then be provided (e.g. to other un-parked vehicles withinthe parking area) that a space is to become available within theidentified rough/approximate location. Such proposals can improve,manage or reduce vehicle movement within in a parking area.

Referring to FIG. 3, a simplified block diagram of system 300 formanagement of parking spaces in a parking area is depicted, according toan embodiment of the present invention. In this example embodiment, theparking area that system 300 manages comprises a plurality of differentzones, wherein each zone comprises a plurality of parking spaces.

In the depicted embodiment, system 300 comprises ticketing system 310,vehicle identification unit 315, parking management unit 340, anddisplay 320. Ticketing system 310, vehicle identification unit 315,parking management unit 340, and display 320 are connected via network330 using suitable wired or wireless communication links.

Ticketing system 310 is adapted to provide a parking ticket (or token)to a vehicle user (e.g., driver) associated with a vehicle parked in theparking area. In doing so, ticketing system 310 associates (e.g., links)the parking ticket with the vehicle associated with the vehicle user.Information/data relating to the parking ticket and its associatedvehicle is provided to parking management unit 340 via network 330.

Vehicle identification unit 315 is adapted to identify a zone withinwhich the vehicle associated with parking ticket is parked. For thispurpose, vehicle identification unit 315 is adapted to utilize images orvideo received from one or more image capture devices that are adaptedto capture images or video of the parking area. For example, vehicleidentification unit 315 may process the images or video in accordancewith a vehicle registration plate recognition algorithm, so as to trackmovement of the vehicle within the parking area. Using such visualtracking and/or monitoring concepts, vehicle identification unit 315 maynot only identify a zone within which the vehicle associated withparking ticket is parked, but may actually identify an individualparking space in which the vehicle is parked. Information/data relatingto the identified location of the vehicle is provided from vehicleidentification unit 315 to parking management unit 340 via network 330.

Responsive to the vehicle user validating the parking ticket, parkingmanagement unit 340 is adapted to determine that the vehicle associatedwith the parking ticket will be leaving the identified zone and/orindividual parking space. Parking management unit 340 is adapted toprovide an indication that a parking space of the identifiedzone/parking space is to become available. In the depicted embodiment,the indication is a visual indication provided by display 320, and soparking management unit 340 communicates with display 320 (via network330) to direct display 320 to display an indication (e.g. message) forcommunicating that a parking space of the identified zone is to becomeavailable.

In more detail, parking management unit 340 is adapted to provide theindication based on a statistical model. Such a statistical modelprovides a probability of a departure time of a vehicle from the parkingarea. For instance, a probabilistic model that is based upon parkinglocations, ticket validation location, and/or travel times and/or speedsof vehicle users may be employed. Parking space prediction engine 360 ofparking management unit 340 may thus utilize statistical modeling engine345 to create statistical model 352 based on parking area data 354,wherein statistical model 352 and parking area data 354 are stored indata storage system 350 of parking management unit 340.

For a validated ticket associated with a vehicle parked in the parkingarea, parking space prediction engine 360 may utilize statisticalmodeling engine 345 to create an instance of a statistical model, suchas statistical model 352, based on parking area data and an identifiedparking location of the vehicle. Such a statistical model may be basedon historical parking area data (e.g., previous departure timeframes—ortime delays between ticket validation and parking space vacation—forvehicles parked in the same location) associated with the parkinglocation. Statistical model 352 is stored in data storage system 350 andassociated with a corresponding instance of parking location data. Inthis way, parking space prediction engine 360 utilizes a statisticalmodel to determine probabilities of a departure time of a vehicle fromthe parking area relative to a validation time of a ticket associatedwith the vehicle.

For example, when a parking ticket associated with a vehicle parked in afirst zone (e.g., Zone A) of the parking area is validated, statisticalmodel 352 may indicate that there is a 95% probability that the vehiclewill leave its parking space after ten minutes, based on parking areadata 354 including previous timeframes taken for vehicles parked in thefirst zone to depart the parking area following ticket validation.

Referring now to FIG. 4, a simplified flow diagram 400 of parkingmanagement unit 340 for management of parking spaces in a parking areacomprising a plurality of zones is depicted, according to an embodiment.

In step 410, parking management unit 340 receives an indication fromticketing system 310 that a parking ticket (or token/voucher) has beenprovided to a vehicle user associated with a vehicle that is parking inthe parking area. In step 420, parking management unit 340 associatesthe parking ticket with the vehicle (associated with the vehicle user).

In step 430, parking management unit 340 identifies an area in which thevehicle is parked. Here, parking management unit 340 utilizes images orvideo received from one or more image capture devices adapted to captureimages or video of the parking area in order to identify and trackmovement of vehicles within the parking area. Vehicle movement may thusbe automatically tracked and monitored in step 430 so as to identify anindividual parking space in which the vehicle is parked. Also, to assistsuch vehicle tracking and parking space identification, parkingmanagement unit 340 may employ known parking space monitoring concepts(such the use of IR or light sensors in parking spaces to identifyvehicle occupancy of parking spaces), thereby improvingtracking/monitoring accuracy and/or reliability.

In other embodiments, it is noted that the step 430 of identifying anarea in which the vehicle is parked may be undertaken separately (e.g.before) in steps 410 and 420. Indeed, in some embodiments, parkingmanagement unit 340 may track vehicle movement and determine a parkinglocation prior to a parking ticket being issued/provided to a driver ofthe vehicle. In these embodiments, the location of vehicle associatedwith a parking ticket may already be known at the time of issuing theticket.

In step 440, parking management unit 340 monitors for validation of theparking ticket. If, in decision 450, parking management unit 340determines that the parking ticket has not yet been validated, parkingmanagement unit 340 returns to step 440, wherein monitoring for ticketvalidation is continued/repeated.

If, in decision 450, parking management unit 340 determines that theparking ticket has been validated, parking management unit 340 continuesto step 460, wherein, responsive to the parking ticket being validated,parking management unit 340 determines that the vehicle associated withthe parking ticket will be leaving the identified parking space in whichthe vehicle is parked. In an embodiment, parking management unit 340makes this determination by inferring that a parking space, such as thatbeing occupied by the vehicle of the vehicle user who has validated theparking ticket, will become available within a predicted timeframe (suchas a time window of less than 10 minutes, less than 5 minutes, or lessthan 2 minutes) following validation (e.g. payment, stamping,processing, etc.) of a parking ticket. In other words, responsive to thevehicle user validating a parking ticket, parking management unit 340determines when the vehicle will be leaving the parking area, and thus,determines when a parking space will become available. In step 470,parking management unit 340 provides an indication that the identifiedparking space is to become available.

From the above-described embodiments, it will be appreciated that theremay be proposed the concept of identifying and/or tracking vehiclepositions in a zoned parking area (such as a car park for example) inconjunction with linking parking tickets to vehicles. Then, by detectingan individual validating a parking ticket (e.g. paying an associatedfee), it may be inferred that the vehicle linked to parking ticket willsoon be leaving the parking area. Knowing the parking location of thevehicle, an indication may then be provided (e.g. to other persons orvehicles in the parking are) that a space will soon become available at(or in) the location of the vehicle linked to the validated ticket. Avehicle seeking a parking space in the parking area may thus be directedto an area or location containing a parking space that will soon becomeavailable, and this may be done prior to the parking space actuallybecoming available.

Embodiments may thus improve or assist management of parking spaces of aparking area by providing additional, accurate and/or timely informationabout the parking spaces that are about to become available. This mayenable better use of time for parking area users and/or reduce fuelconsumption and CO2 emissions associated with vehicles searching for aparking space.

By way of further example, an implementation of an embodiment will nowbe summarized in the context of a car park that is split into zones thatare monitored using an automated number plate recognition system. Here,the car park is a multi-story car park comprising a plurality of levels,wherein each level is a different zone. Steps of the embodiment may besummarized as follows:

(I) When a car enters the car park, its number plate is identified usinga camera and a uniquely associated parking ticket is generated.

(II) The car then parks in an available parking space on level 2 of thecar park (i.e. in Zone 2).

(III) Number plate recognition (NPR) cameras are used through the carpark, sited in a way that they are able to track cars entering andleaving each zone. A computer keeps track of which cars are in whichzone. At the point where the driver of a car can make a decision as towhether to enter a zone or move to a next zone, an electronic sign isprovided showing an estimate of currently free spaces, and in anestimate of spaces becoming free in the next few minutes. By trackingcars in each zone (using the NPR cameras) it is known which cars enterand exit each zone, and it is also known how many parking spaces arefree in each zone (e.g. if one assumes that if a car is in a zone it isoccupying a parking space).(IV) A computer and database keeps track of which cars are in whichzones.(V) An estimate of spaces becoming free in the next few minutes is thengenerated by monitoring vehicle users paying for their parking using theuniquely associated parking ticket. When a vehicle user pays for theirparking (i.e. validates their parking ticket by putting their parkingticket into a machine), information about the vehicle associated withthe parking ticket is retrieved (e.g. form a data store of a computersystem). Inferring that the vehicle uniquely associated with the parkingticket will be leaving in the near future, and knowing the location(e.g. zone) where the vehicle is parked, a “spaces becoming free” countfor that location/zone can then been incremented (until it is detectedthat the vehicle as left the location/zone, at which point “a spacesfree” count can be incremented and the “spaces becoming free” countdecremented).

As illustrated in FIG. 5, embodiments may comprise a computersystem/server 70, which may form part of a networked system 7. Thecomponents of computer system/server 70 may include, but are not limitedto, one or more processing arrangements, for example comprisingprocessors or processing units 71, system memory 74, and bus 90 thatcouples various system components including system memory 74 toprocessing unit 71.

Bus 90 represents one or more of any of several types of bus structures,including a memory bus or memory controller, a peripheral bus, anaccelerated graphics port, and a processor or local bus using any of avariety of bus architectures. By way of example, and not limitation,such architectures include Industry Standard Architecture (ISA) bus,Micro Channel Architecture (MCA) bus, Enhanced ISA (EISA) bus, VideoElectronics Standards Association (VESA) local bus, and PeripheralComponent Interconnect (PCI) bus.

Computer system/server 70 typically includes a variety of computersystem readable media. Such media may be any available media that isaccessible by computer system/server 70, and it includes both volatileand non-volatile media, removable and non-removable media.

System memory 74 can include computer system readable media in the formof volatile memory, such as random access memory (RAM) 75 and/or cachememory 76. Computer system/server 70 may further include otherremovable/non-removable, volatile/non-volatile computer system storagemedia. By way of example only, system memory 74 can be provided forreading from and writing to a non-removable, non-volatile magnetic media(not shown and typically called a “hard drive”). Although not shown, amagnetic disk drive for reading from and writing to a removable,non-volatile magnetic disk (e.g., a “floppy disk”), and an optical diskdrive for reading from or writing to a removable, non-volatile opticaldisk such as a CD-ROM, DVD-ROM or other optical media can be provided.In such instances, each can be connected to bus 90 by one or more datamedia interfaces. As will be further depicted and described below,memory 74 may include at least one program product having a set (e.g.,at least one) of program modules that are configured to carry out thefunctions of embodiments of the invention.

Program/utility 78, having a set (at least one) of program modules 79,may be stored in system memory 74 by way of example, and not limitation,as well as an operating system, one or more application programs, otherprogram modules, and program data. Each of the operating system, one ormore application programs, other program modules, and program data orsome combination thereof, may include an implementation of a networkingenvironment. Program modules 79 generally carry out the functions and/ormethodologies of embodiments of the invention as described herein.

Computer system/server 70 may also communicate with one or more externaldevices 80 such as a keyboard, a pointing device, display 85, etc.; oneor more devices that enable a user to interact with computersystem/server 70; and/or any devices (e.g., network card, modem, etc.)that enable computer system/server 70 to communicate with one or moreother computing devices. Such communication can occur via input/output(I/O) interfaces 72. Still yet, computer system/server 70 cancommunicate with one or more networks such as a local area network(LAN), a general wide area network (WAN), and/or a public network (e.g.,the Internet) via network adapter 73. As depicted, network adapter 73communicates with the other components of computer system/server 70 viabus 90. It should be understood that although not shown, other hardwareand/or software components could be used in conjunction with computersystem/server 70. Examples, include, but are not limited to: microcode,device drivers, redundant processing units, external disk drive arrays,RAID systems, tape drives, and data archival storage systems, etc.

In the context of the present application, where embodiments of thepresent invention constitute a method, it should be understood that sucha method is a process for execution by a computer, i.e. is acomputer-implementable method. The various steps of the method thereforereflect various parts of a computer program, e.g. various parts of oneor more algorithms.

The present invention may be a system, a method, and/or a computerprogram product. The computer program product may include a computerreadable storage medium (or media) having computer readable programinstructions thereon for causing a processor to carry out aspects of thepresent invention.

The computer readable storage medium can be a tangible device that canretain and store instructions for use by an instruction executiondevice. The computer readable storage medium may be, for example, but isnot limited to, an electronic storage device, a magnetic storage device,an optical storage device, an electromagnetic storage device, asemiconductor storage device, or any suitable combination of theforegoing. A non-exhaustive list of more specific examples of thecomputer readable storage medium includes the following: a portablecomputer diskette, a hard disk, a random access memory (RAM), aread-only memory (ROM), an erasable programmable read-only memory (EPROMor Flash memory), a storage class memory (SCM), a static random accessmemory (SRAM), a portable compact disc read-only memory (CD-ROM), adigital versatile disk (DVD), a memory stick, a floppy disk, amechanically encoded device such as punch-cards or raised structures ina groove having instructions recorded thereon, and any suitablecombination of the foregoing. A computer readable storage medium, asused herein, is not to be construed as being transitory signals per se,such as radio waves or other freely propagating electromagnetic waves,electromagnetic waves propagating through a waveguide or othertransmission media (e.g., light pulses passing through a fiber-opticcable), or electrical signals transmitted through a wire.

Computer readable program instructions described herein can bedownloaded to respective computing/processing devices from a computerreadable storage medium or to an external computer or external storagedevice via a network, for example, the Internet, a local area network, awide area network and/or a wireless network. The network may comprisecopper transmission cables, optical transmission fibers, wirelesstransmission, routers, firewalls, switches, gateway computers and/oredge servers. A network adapter card or network interface in eachcomputing/processing device receives computer readable programinstructions from the network and forwards the computer readable programinstructions for storage in a computer readable storage medium withinthe respective computing/processing device.

Computer readable program instructions for carrying out operations ofthe present invention may be assembler instructions,instruction-set-architecture (ISA) instructions, machine instructions,machine dependent instructions, microcode, firmware instructions,state-setting data, or either source code or object code written in anycombination of one or more programming languages, including an objectoriented programming language such as Smalltalk, C++ or the like, andconventional procedural programming languages, such as the “C”programming language or similar programming languages. The computerreadable program instructions may execute entirely on the user'scomputer, partly on the user's computer, as a stand-alone softwarepackage, partly on the user's computer and partly on a remote computeror entirely on the remote computer or server. In the latter scenario,the remote computer may be connected to the user's computer through anytype of network, including a local area network (LAN) or a wide areanetwork (WAN), or the connection may be made to an external computer(for example, through the Internet using an Internet Service Provider).In some embodiments, electronic circuitry including, for example,programmable logic circuitry, field-programmable gate arrays (FPGA), orprogrammable logic arrays (PLA) may execute the computer readableprogram instructions by utilizing state information of the computerreadable program instructions to personalize the electronic circuitry,in order to perform aspects of the present invention.

Aspects of the present invention are described herein with reference toflowchart illustrations and/or block diagrams of methods, apparatus(systems), and computer program products according to embodiments of theinvention. It will be understood that each block of the flowchartillustrations and/or block diagrams, and combinations of blocks in theflowchart illustrations and/or block diagrams, can be implemented bycomputer readable program instructions.

These computer readable program instructions may be provided to aprocessor of a general purpose computer, special purpose computer, orother programmable data processing apparatus to produce a machine, suchthat the instructions, which execute via the processor of the computeror other programmable data processing apparatus, create means forimplementing the functions/acts specified in the flowchart and/or blockdiagram block or blocks. These computer readable program instructionsmay also be stored in a computer readable storage medium that can directa computer, a programmable data processing apparatus, and/or otherdevices to function in a particular manner, such that the computerreadable storage medium having instructions stored therein comprises anarticle of manufacture including instructions which implement aspects ofthe function/act specified in the flowchart and/or block diagram blockor blocks.

The computer readable program instructions may also be loaded onto acomputer, other programmable data processing apparatus, or other deviceto cause a series of operational steps to be performed on the computer,other programmable apparatus or other device to produce a computerimplemented process, such that the instructions which execute on thecomputer, other programmable apparatus, or other device implement thefunctions/acts specified in the flowchart and/or block diagram block orblocks.

The flowchart and block diagrams in the Figures illustrate thearchitecture, functionality, and operation of possible implementationsof systems, methods, and computer program products according to variousembodiments of the present invention. In this regard, each block in theflowchart or block diagrams may represent a module, segment, or portionof instructions, which comprises one or more executable instructions forimplementing the specified logical function(s). In some alternativeimplementations, the functions noted in the block may occur out of theorder noted in the figures. For example, two blocks shown in successionmay, in fact, be executed substantially concurrently, or the blocks maysometimes be executed in the reverse order, depending upon thefunctionality involved. It will also be noted that each block of theblock diagrams and/or flowchart illustration, and combinations of blocksin the block diagrams and/or flowchart illustration, can be implementedby special purpose hardware-based systems that perform the specifiedfunctions or acts or carry out combinations of special purpose hardwareand computer instructions.

The descriptions of the various embodiments of the present inventionhave been presented for purposes of illustration, but are not intendedto be exhaustive or limited to the embodiments disclosed. Manymodifications and variations will be apparent to those of ordinary skillin the art without departing from the scope and spirit of the describedembodiments. The terminology used herein was chosen to best explain theprinciples of the embodiments, the practical application or technicalimprovement over technologies found in the marketplace, or to enableothers of ordinary skill in the art to understand the embodimentsdisclosed herein.

What is claimed is:
 1. A computer program product for management of parking spaces, the computer program product comprising a non-transitory computer readable storage medium having program instructions embodied therewith, wherein the program instructions are executable by a processing unit to cause the processing unit to perform a method comprising: providing a ticket to an individual associated with a vehicle parked in a parking area, wherein the parking area comprises a plurality of zones and each zone comprises one or more parking spaces; associating the ticket with the vehicle associated with the individual; identifying a first location in which the vehicle is parked, wherein the first location is within a first zone of the parking area; responsive to the individual validating the ticket at a second location at a first time, determining that the vehicle associated with the ticket will be leaving the first zone at a second time based on a distance between the individual validating the ticket at the second location and the vehicle parked at the first location, wherein the second time is subsequent in time to the first time; and providing an indication at a third time that a parking space of the first zone is to become available at the second time, wherein the second time is subsequent in time to the third time.
 2. The computer program product of claim 1, wherein: identifying the first location in which the vehicle is parked comprises identifying a first parking space in which the vehicle is parked; and providing the indication comprises providing the indication that the identified first parking space is to become available.
 3. The computer program product of claim 1, wherein identifying the first location in which the vehicle is parked comprises utilizing at least one of images and video received from one or more image capture devices adapted to capture at least one of images and video of the parking area.
 4. The computer program product of claim 3, wherein utilizing the at least one of images and video comprises processing the at least one of images and video in accordance with a vehicle registration plate recognition algorithm.
 5. The computer program product of claim 1, wherein providing the indication is based on a statistical model, wherein the statistical model provides a probability of a departure time of the vehicle from the parking area.
 6. The computer program product of claim 1, wherein identifying the first location in which the vehicle is parked comprises tracking movement of the vehicle within the parking area.
 7. A computer system for management of parking spaces, the computer system comprising: one or more computer hardware processors; one or more non-transitory computer readable storage media; program instructions stored on the non-transitory computer readable storage media for execution by at least one of the one or more computer hardware processors, the program instructions comprising: program instructions to provide a ticket to an individual associated with a vehicle parked in a parking area, wherein the parking area comprises a plurality of zones and each zone comprises one or more parking spaces; program instructions to associate the ticket with the vehicle associated with the individual; program instructions to identify a first location in which the vehicle is parked, wherein the first location is within a first zone of the parking area; responsive to the individual validating the ticket at a second location at a first time, program instructions to determine that the vehicle associated with the ticket will be leaving the first zone at a second time based on a distance between the individual validating the ticket at the second location and the vehicle parked at the first location, wherein the second time is subsequent in time to the first time; and program instructions to provide an indication at a third time that a parking space of the first zone is to become available at the second time, wherein the second time is subsequent in time to the third time.
 8. The computer system of claim 7, wherein: the program instructions to identify the first location in which the vehicle is parked comprise program instructions to identify a first parking space in which the vehicle is parked; and the program instructions to provide the indication comprise program instructions to provide the indication that the identified first parking space is to become available.
 9. The computer system of claim 7, wherein the program instructions to identify the first location in which the vehicle is parked comprise program instructions to utilize at least one of images and video received from one or more image capture devices adapted to capture at least one of images and video of the parking area.
 10. The computer system of claim 9, wherein the program instructions to utilize the at least one of images and video further comprise program instructions to process the at least one of images and video in accordance with a vehicle registration plate recognition algorithm.
 11. The computer system of claim 7, wherein the program instructions to provide the indication is based on a statistical model, wherein the statistical model provides a probability of a departure time of the vehicle from the parking area. 